TSTP Solution File: SEV136^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV136^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:28 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 17
% Syntax : Number of formulae : 55 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 496 ( 154 equ; 0 cnn)
% Maximal formula atoms : 24 ( 11 avg)
% Number of connectives : 744 ( 91 ~; 83 |; 62 &; 474 @)
% ( 3 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 85 ( 85 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 146 ( 0 ^ 108 !; 36 ?; 146 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( a > a > $o ) > a > a > $o ).
thf(func_def_6,type,
sK1: a > a > $o ).
thf(func_def_7,type,
sK2: a ).
thf(func_def_8,type,
sK3: a ).
thf(func_def_9,type,
sK4: ( a > $o ) > a ).
thf(func_def_10,type,
sK5: ( a > $o ) > a ).
thf(func_def_12,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f63,plain,
$false,
inference(avatar_sat_refutation,[],[f31,f36,f43,f62]) ).
thf(f62,plain,
( spl6_2
| ~ spl6_1
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f61,f40,f24,f28]) ).
thf(f28,plain,
( spl6_2
<=> ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f24,plain,
( spl6_1
<=> ( $true
= ( sK0 @ sK1 @ sK2 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f40,plain,
( spl6_3
<=> ( $true
= ( sK1 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f61,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ( $true != $true )
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f58,f18]) ).
thf(f18,plain,
! [X5: a] :
( $true
= ( sK0 @ sK1 @ X5 @ X5 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X2: a,X3: a,X4: a] :
( ( ( sK0 @ sK1 @ X2 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ sK1 @ X3 @ X4 ) )
| ( $true
= ( sK0 @ sK1 @ X2 @ X4 ) ) )
& ! [X5: a] :
( $true
= ( sK0 @ sK1 @ X5 @ X5 ) )
& ! [X6: a,X7: a] :
( ( $true
= ( sK0 @ sK1 @ X7 @ X6 ) )
| ( $true
!= ( sK1 @ X7 @ X6 ) ) )
& ( $true
!= ( sK0 @ sK1 @ sK2 @ sK3 ) )
& ! [X10: a > $o] :
( ( $true
!= ( X10 @ sK2 ) )
| ( ( $true
= ( X10 @ ( sK5 @ X10 ) ) )
& ( $true
!= ( X10 @ ( sK4 @ X10 ) ) )
& ( $true
= ( sK1 @ ( sK5 @ X10 ) @ ( sK4 @ X10 ) ) ) )
| ( ( X10 @ sK3 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: ( a > a > $o ) > a > a > $o,X1: a > a > $o] :
( ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( X0 @ X1 @ X2 @ X3 ) )
| ( $true
!= ( X0 @ X1 @ X3 @ X4 ) )
| ( $true
= ( X0 @ X1 @ X2 @ X4 ) ) )
& ! [X5: a] :
( $true
= ( X0 @ X1 @ X5 @ X5 ) )
& ! [X6: a,X7: a] :
( ( $true
= ( X0 @ X1 @ X7 @ X6 ) )
| ( $true
!= ( X1 @ X7 @ X6 ) ) )
& ? [X8: a,X9: a] :
( ( $true
!= ( X0 @ X1 @ X8 @ X9 ) )
& ! [X10: a > $o] :
( ( ( X10 @ X8 )
!= $true )
| ? [X11: a,X12: a] :
( ( $true
= ( X10 @ X12 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( $true
= ( X1 @ X12 @ X11 ) ) )
| ( $true
= ( X10 @ X9 ) ) ) ) )
=> ( ! [X4: a,X3: a,X2: a] :
( ( ( sK0 @ sK1 @ X2 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ sK1 @ X3 @ X4 ) )
| ( $true
= ( sK0 @ sK1 @ X2 @ X4 ) ) )
& ! [X5: a] :
( $true
= ( sK0 @ sK1 @ X5 @ X5 ) )
& ! [X7: a,X6: a] :
( ( $true
= ( sK0 @ sK1 @ X7 @ X6 ) )
| ( $true
!= ( sK1 @ X7 @ X6 ) ) )
& ? [X9: a,X8: a] :
( ( $true
!= ( sK0 @ sK1 @ X8 @ X9 ) )
& ! [X10: a > $o] :
( ( ( X10 @ X8 )
!= $true )
| ? [X12: a,X11: a] :
( ( $true
= ( X10 @ X12 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( $true
= ( sK1 @ X12 @ X11 ) ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X9: a,X8: a] :
( ( $true
!= ( sK0 @ sK1 @ X8 @ X9 ) )
& ! [X10: a > $o] :
( ( ( X10 @ X8 )
!= $true )
| ? [X12: a,X11: a] :
( ( $true
= ( X10 @ X12 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( $true
= ( sK1 @ X12 @ X11 ) ) )
| ( $true
= ( X10 @ X9 ) ) ) )
=> ( ( $true
!= ( sK0 @ sK1 @ sK2 @ sK3 ) )
& ! [X10: a > $o] :
( ( $true
!= ( X10 @ sK2 ) )
| ? [X12: a,X11: a] :
( ( $true
= ( X10 @ X12 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( $true
= ( sK1 @ X12 @ X11 ) ) )
| ( ( X10 @ sK3 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X10: a > $o] :
( ? [X12: a,X11: a] :
( ( $true
= ( X10 @ X12 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( $true
= ( sK1 @ X12 @ X11 ) ) )
=> ( ( $true
= ( X10 @ ( sK5 @ X10 ) ) )
& ( $true
!= ( X10 @ ( sK4 @ X10 ) ) )
& ( $true
= ( sK1 @ ( sK5 @ X10 ) @ ( sK4 @ X10 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: ( a > a > $o ) > a > a > $o,X1: a > a > $o] :
( ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( X0 @ X1 @ X2 @ X3 ) )
| ( $true
!= ( X0 @ X1 @ X3 @ X4 ) )
| ( $true
= ( X0 @ X1 @ X2 @ X4 ) ) )
& ! [X5: a] :
( $true
= ( X0 @ X1 @ X5 @ X5 ) )
& ! [X6: a,X7: a] :
( ( $true
= ( X0 @ X1 @ X7 @ X6 ) )
| ( $true
!= ( X1 @ X7 @ X6 ) ) )
& ? [X8: a,X9: a] :
( ( $true
!= ( X0 @ X1 @ X8 @ X9 ) )
& ! [X10: a > $o] :
( ( ( X10 @ X8 )
!= $true )
| ? [X11: a,X12: a] :
( ( $true
= ( X10 @ X12 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( $true
= ( X1 @ X12 @ X11 ) ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X1: ( a > a > $o ) > a > a > $o,X0: a > a > $o] :
( ! [X5: a,X6: a,X7: a] :
( ( $true
!= ( X1 @ X0 @ X5 @ X6 ) )
| ( $true
!= ( X1 @ X0 @ X6 @ X7 ) )
| ( ( X1 @ X0 @ X5 @ X7 )
= $true ) )
& ! [X4: a] :
( $true
= ( X1 @ X0 @ X4 @ X4 ) )
& ! [X3: a,X2: a] :
( ( ( X1 @ X0 @ X2 @ X3 )
= $true )
| ( ( X0 @ X2 @ X3 )
!= $true ) )
& ? [X9: a,X8: a] :
( ( $true
!= ( X1 @ X0 @ X9 @ X8 ) )
& ! [X10: a > $o] :
( ( $true
!= ( X10 @ X9 ) )
| ? [X12: a,X11: a] :
( ( $true
= ( X10 @ X11 ) )
& ( $true
!= ( X10 @ X12 ) )
& ( $true
= ( X0 @ X11 @ X12 ) ) )
| ( ( X10 @ X8 )
= $true ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ? [X9: a,X8: a] :
( ( $true
!= ( X1 @ X0 @ X9 @ X8 ) )
& ! [X10: a > $o] :
( ( ( X10 @ X8 )
= $true )
| ( $true
!= ( X10 @ X9 ) )
| ? [X11: a,X12: a] :
( ( $true
!= ( X10 @ X12 ) )
& ( $true
= ( X0 @ X11 @ X12 ) )
& ( $true
= ( X10 @ X11 ) ) ) ) )
& ! [X3: a,X2: a] :
( ( ( X1 @ X0 @ X2 @ X3 )
= $true )
| ( ( X0 @ X2 @ X3 )
!= $true ) )
& ! [X7: a,X6: a,X5: a] :
( ( ( X1 @ X0 @ X5 @ X7 )
= $true )
| ( $true
!= ( X1 @ X0 @ X5 @ X6 ) )
| ( $true
!= ( X1 @ X0 @ X6 @ X7 ) ) )
& ! [X4: a] :
( $true
= ( X1 @ X0 @ X4 @ X4 ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X3: a,X2: a] :
( ( ( X0 @ X2 @ X3 )
= $true )
=> ( ( X1 @ X0 @ X2 @ X3 )
= $true ) )
& ! [X7: a,X6: a,X5: a] :
( ( ( $true
= ( X1 @ X0 @ X5 @ X6 ) )
& ( $true
= ( X1 @ X0 @ X6 @ X7 ) ) )
=> ( ( X1 @ X0 @ X5 @ X7 )
= $true ) )
& ! [X4: a] :
( $true
= ( X1 @ X0 @ X4 @ X4 ) ) )
=> ! [X9: a,X8: a] :
( ! [X10: a > $o] :
( ! [X11: a,X12: a] :
( ( ( $true
= ( X0 @ X11 @ X12 ) )
& ( $true
= ( X10 @ X11 ) ) )
=> ( $true
= ( X10 @ X12 ) ) )
=> ( ( $true
= ( X10 @ X9 ) )
=> ( ( X10 @ X8 )
= $true ) ) )
=> ( $true
= ( X1 @ X0 @ X9 @ X8 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X2: a,X3: a] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X0 @ X2 @ X3 ) )
& ! [X4: a] : ( X1 @ X0 @ X4 @ X4 )
& ! [X5: a,X6: a,X7: a] :
( ( ( X1 @ X0 @ X5 @ X6 )
& ( X1 @ X0 @ X6 @ X7 ) )
=> ( X1 @ X0 @ X5 @ X7 ) ) )
=> ! [X8: a,X9: a] :
( ! [X10: a > $o] :
( ! [X11: a,X12: a] :
( ( ( X10 @ X11 )
& ( X0 @ X11 @ X12 ) )
=> ( X10 @ X12 ) )
=> ( ( X10 @ X9 )
=> ( X10 @ X8 ) ) )
=> ( X1 @ X0 @ X9 @ X8 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X2: a,X3: a] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X0 @ X2 @ X3 ) )
& ! [X2: a] : ( X1 @ X0 @ X2 @ X2 )
& ! [X2: a,X3: a,X4: a] :
( ( ( X1 @ X0 @ X2 @ X3 )
& ( X1 @ X0 @ X3 @ X4 ) )
=> ( X1 @ X0 @ X2 @ X4 ) ) )
=> ! [X3: a,X2: a] :
( ! [X5: a > $o] :
( ! [X6: a,X4: a] :
( ( ( X5 @ X6 )
& ( X0 @ X6 @ X4 ) )
=> ( X5 @ X4 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X3 ) ) )
=> ( X1 @ X0 @ X2 @ X3 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X2: a,X3: a] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X0 @ X2 @ X3 ) )
& ! [X2: a] : ( X1 @ X0 @ X2 @ X2 )
& ! [X2: a,X3: a,X4: a] :
( ( ( X1 @ X0 @ X2 @ X3 )
& ( X1 @ X0 @ X3 @ X4 ) )
=> ( X1 @ X0 @ X2 @ X4 ) ) )
=> ! [X3: a,X2: a] :
( ! [X5: a > $o] :
( ! [X6: a,X4: a] :
( ( ( X5 @ X6 )
& ( X0 @ X6 @ X4 ) )
=> ( X5 @ X4 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X3 ) ) )
=> ( X1 @ X0 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sUyEao1ITi/Vampire---4.8_24458',cTHM203_pme) ).
thf(f58,plain,
( ( $true
!= ( sK0 @ sK1 @ sK2 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f57,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK1 @ sK2 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(superposition,[],[f14,f55]) ).
thf(f55,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f53,plain,
( ( $true != $true )
| ( $true
= ( sK0 @ sK1 @ sK2 @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(superposition,[],[f49,f26]) ).
thf(f26,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f49,plain,
( ! [X0: a] :
( ( ( sK0 @ sK1 @ X0 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) )
!= $true )
| ( $true
= ( sK0 @ sK1 @ X0 @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f48,plain,
( ! [X0: a] :
( ( $true
= ( sK0 @ sK1 @ X0 @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ( ( sK0 @ sK1 @ X0 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) )
!= $true )
| ( $true != $true ) )
| ~ spl6_3 ),
inference(superposition,[],[f19,f47]) ).
thf(f47,plain,
( ( $true
= ( sK0 @ sK1 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
( ( $true
= ( sK0 @ sK1 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ( $true != $true )
| ~ spl6_3 ),
inference(superposition,[],[f17,f42]) ).
thf(f42,plain,
( ( $true
= ( sK1 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f17,plain,
! [X6: a,X7: a] :
( ( $true
!= ( sK1 @ X7 @ X6 ) )
| ( $true
= ( sK0 @ sK1 @ X7 @ X6 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f19,plain,
! [X2: a,X3: a,X4: a] :
( ( $true
!= ( sK0 @ sK1 @ X3 @ X4 ) )
| ( $true
= ( sK0 @ sK1 @ X2 @ X4 ) )
| ( ( sK0 @ sK1 @ X2 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f14,plain,
! [X10: a > $o] :
( ( $true
!= ( X10 @ ( sK4 @ X10 ) ) )
| ( ( X10 @ sK3 )
= $true )
| ( $true
!= ( X10 @ sK2 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f43,plain,
( spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f38,f40,f28]) ).
thf(f38,plain,
( ( $true
= ( sK1 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f37,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ( $true
= ( sK1 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) @ ( sK4 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f13,f18]) ).
thf(f13,plain,
! [X10: a > $o] :
( ( $true
!= ( X10 @ sK2 ) )
| ( $true
= ( sK1 @ ( sK5 @ X10 ) @ ( sK4 @ X10 ) ) )
| ( ( X10 @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f36,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f35]) ).
thf(f35,plain,
( $false
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f32,plain,
( ( $true != $true )
| ~ spl6_2 ),
inference(superposition,[],[f16,f30]) ).
thf(f30,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f16,plain,
( $true
!= ( sK0 @ sK1 @ sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f31,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f22,f28,f24]) ).
thf(f22,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) ) )
| ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 @ sK3 ) )
| ( $true != $true )
| ( $true
= ( sK0 @ sK1 @ sK2 @ ( sK5 @ ( sK0 @ sK1 @ sK2 ) ) ) ) ),
inference(superposition,[],[f15,f18]) ).
thf(f15,plain,
! [X10: a > $o] :
( ( $true
!= ( X10 @ sK2 ) )
| ( ( X10 @ sK3 )
= $true )
| ( $true
= ( X10 @ ( sK5 @ X10 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEV136^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n023.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 12:15:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.10/0.31 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.sUyEao1ITi/Vampire---4.8_24458
% 0.15/0.33 % (24567)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.33 % (24568)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.33 % (24569)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.33 % (24570)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.33 % (24566)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.33 % (24571)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.33 % (24573)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.33 % (24572)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.15/0.33 % (24569)Instruction limit reached!
% 0.15/0.33 % (24569)------------------------------
% 0.15/0.33 % (24569)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (24569)Termination reason: Unknown
% 0.15/0.33 % (24569)Termination phase: Preprocessing 3
% 0.15/0.33
% 0.15/0.33 % (24570)Instruction limit reached!
% 0.15/0.33 % (24570)------------------------------
% 0.15/0.33 % (24570)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (24570)Termination reason: Unknown
% 0.15/0.33 % (24570)Termination phase: Property scanning
% 0.15/0.33
% 0.15/0.33 % (24570)Memory used [KB]: 895
% 0.15/0.33 % (24570)Time elapsed: 0.002 s
% 0.15/0.33 % (24570)Instructions burned: 2 (million)
% 0.15/0.33 % (24570)------------------------------
% 0.15/0.33 % (24570)------------------------------
% 0.15/0.33 % (24569)Memory used [KB]: 895
% 0.15/0.33 % (24569)Time elapsed: 0.002 s
% 0.15/0.33 % (24569)Instructions burned: 2 (million)
% 0.15/0.33 % (24569)------------------------------
% 0.15/0.33 % (24569)------------------------------
% 0.15/0.33 % (24573)Instruction limit reached!
% 0.15/0.33 % (24573)------------------------------
% 0.15/0.33 % (24573)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (24573)Termination reason: Unknown
% 0.15/0.33 % (24573)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (24573)Memory used [KB]: 5500
% 0.15/0.33 % (24573)Time elapsed: 0.003 s
% 0.15/0.33 % (24573)Instructions burned: 3 (million)
% 0.15/0.33 % (24573)------------------------------
% 0.15/0.33 % (24573)------------------------------
% 0.15/0.33 % (24567)Instruction limit reached!
% 0.15/0.33 % (24567)------------------------------
% 0.15/0.33 % (24567)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (24567)Termination reason: Unknown
% 0.15/0.33 % (24567)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (24567)Memory used [KB]: 5500
% 0.15/0.33 % (24567)Time elapsed: 0.004 s
% 0.15/0.33 % (24567)Instructions burned: 4 (million)
% 0.15/0.33 % (24567)------------------------------
% 0.15/0.33 % (24567)------------------------------
% 0.15/0.33 % (24568)First to succeed.
% 0.15/0.33 % (24568)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for Vampire---4
% 0.15/0.33 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.33 % (24568)------------------------------
% 0.15/0.33 % (24568)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (24568)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (24568)Memory used [KB]: 5628
% 0.15/0.33 % (24568)Time elapsed: 0.009 s
% 0.15/0.33 % (24568)Instructions burned: 8 (million)
% 0.15/0.33 % (24568)------------------------------
% 0.15/0.33 % (24568)------------------------------
% 0.15/0.33 % (24565)Success in time 0.008 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------